package com.estar.integaration.DS;

import com.graphbuilder.struc.Bag;
import lombok.Data;

import java.util.LinkedList;
import java.util.List;

/**
 * Author: YJL
 * Date: 2021/12/29 14:20
 **/
@Data
public class Graph {

  private int vertexNum; //点的个数
  private int edgeNum;//边的个数
  private Integer[][] vertices;//点数组
  private Vertex[] vertexs;//顶点数组
  LinkedList<LinkedList<Integer>> linkedListVertices;

  public Graph(int vNum,Integer[][] vertices,Vertex[] vertexs,LinkedList<LinkedList<Integer>> linkedListVertices){
    this.vertexNum = vNum;
    this.edgeNum = 0;
    this.vertices = vertices;//邻接矩阵
    this.vertexs = vertexs;
    this.linkedListVertices = linkedListVertices;
  }

  public LinkedList<LinkedList<Integer>> getLinkedListVertices() {
    return linkedListVertices;
  }

  public void setLinkedListVertices(LinkedList<LinkedList<Integer>> linkedListVertices) {
    this.linkedListVertices = linkedListVertices;
  }

  public int getVertexNum() {
    return vertexNum;
  }

  public void setVertexNum(int vertexNum) {
    this.vertexNum = vertexNum;
  }

  public int getEdgeNum() {
    return edgeNum;
  }

  public void setEdgeNum(int edgeNum) {
    this.edgeNum = edgeNum;
  }

  public Integer[][] getVertices() {
    return vertices;
  }

  public void setVertices(Integer[][] vertices) {
    this.vertices = vertices;
  }

}
